Optimal neighborhood indexing for protein similarity search
نویسندگان
چکیده
منابع مشابه
PSI: indexing protein structures for fast similarity search
MOTIVATION We consider the problem of finding similarities in protein structure databases. Current techniques sequentially compare the given query protein to all of the proteins in the database to find similarities. Therefore, the cost of similarity queries increases linearly as the volume of the protein databases increase. As the sizes of experimentally determined and theoretically estimated p...
متن کاملQuery-driven iterated neighborhood graph search for scalable visual indexing
In this paper, we address the approximate nearest neighbor (ANN) search problem over large scale visual descriptors. We investigate a simple but very effective approach, neighborhood graph (NG) search, which conducts the local search by expanding neighborhoods with a best-first manner. Expanding neighborhood makes it efficient to locate the descriptors with high probability being true NNs. Howe...
متن کاملSimilarity Search for Sequences of Di erent Lengths : Matchingand Indexing
Similarity match queries are common and important in many database applications with sequence data, such as text databases, genetics, time series, scientiic experiments, etc.. In this paper, we consider the problem of eecient matching and retrieval of sequences of diierent lengths. Most of the previous research in this area concentrates on similarity matching and retrieval of sequences of the s...
متن کاملIndexing Schemes for Similarity Search: an Illustrated Paradigm
We suggest a variation of the Hellerstein— Koutsoupias—Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the structure of indexing schemes for similarity-based search and the geometry of similarity workloads. This in particular provides a unified approach to a great variety of schemes used to index into metric spaces and facil...
متن کاملSearch Efficiency in Indexing Structures for Similarity Searching
Similarity searching finds application in a wide variety of domains including multilingual databases, computational biology, pattern recognition and text retrieval. Similarity is measured in terms of a distance function (edit distance) in general metric spaces, which is expensive to compute. Indexing techniques can be used reduce the number of distance computations. We present an analysis of va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2008
ISSN: 1471-2105
DOI: 10.1186/1471-2105-9-534